On a Class of Subset Selection Procedures
نویسندگان
چکیده
منابع مشابه
Likelihood Ratio Procedures for Subset Selection and Ranking Problems
This report deals with procedures for random-size subset selection from k(> 2) given populations where the distribution of ir^(i = l, ..., k) has a density f^(x;0^). Let ••• -®[k] denote unknown values of the parameters, and let ^[i]» ***'ïï[k] denote the corresponding populations. First, we have considered the problem of selection for consider the /s procedure that selects TT. if sup L(0;x) > ...
متن کاملA Note on Column Subset Selection
Given a matrix U , using a deterministic method, we extract a "large" submatrix of Ũ (whose columns are obtained by normalizing those of U ) and estimate its smallest and largest singular value. We apply this result to the study of contact points of the unit ball with its maximal volume ellipsoid. We consider also the paving problem and give a deterministic algorithm to partition a matrix into ...
متن کاملFeature Subset Selection, Class Separability, and Genetic Algorithms
The performance of classification algorithms in machine learning is affected by the features used to describe the labeled examples presented to the inducers. Therefore, the problem of feature subset selection has received considerable attention. Genetic approaches to this problem usually follow the wrapper approach: treat the inducer as a black box that is used to evaluate candidate feature sub...
متن کاملClass Subset Selection for Transfer Learning using Submodularity
In recent years, it is common practice to extract fullyconnected-layer (fc) features that were learned while performing image classification on a source dataset, such as ImageNet, and apply them generally to a wide range of other tasks. The general usefulness of some large training datasets for transfer learning is not yet well understood, and raises a number of questions. For example, in the c...
متن کاملFeature Subset Selection for Multi-class SVM Based Image Classification
Multi-class image classification can benefit much from feature subset selection. This paper extends an error bound of binary SVMs to a feature subset selection criterion for the multi-class SVMs. By minimizing this criterion, the scale factors assigned to each feature in a kernel function are optimized to identify the important features. This minimization problem can be efficiently solved by gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1972
ISSN: 0003-4851
DOI: 10.1214/aoms/1177692547